Problem Decomposition in Configuration
نویسندگان
چکیده
In the present work the issue of decomposing a configuration problem is approached in a framework where the domain knowledge is represented in a structured way by using a KL-One like language and whole-part relations play a major role in defining the structure of the configurable objects. The representation formalism provides also a constraint language for expressing complex relations among components and subcomponents. The paper presents a notion of boundness among constraints which assures that two components not involved in a same set of bound constraints can be independently configured. The computation of boundness among constraints is the basis for partitioning constraints associated with each component to be configured. Such a partitioning induces a decomposition of the configuration problem into independent subproblems. Both a recursive and a non recursive decomposition strategies are presented and the savings in computational time and reduction in search space are shown in the domain of PC configuration.
منابع مشابه
A Hybrid Solution Approach Based on Benders Decomposition and Meta-Heuristics to Solve Supply Chain Network Design Problem
Supply Chain Network Design (SCND) is a strategic supply chain management problem that determines its configuration. This mainly focuses on the facilities location, capacity sizing, technology selection, supplier selection, transportation, allocation of production and distribution facilities to the market, and so on. Although the optimal solution of the SCND problem leads to a significant reduc...
متن کاملAmenability of groups and semigroups characterized by configuration
In 2005, A. Abdollahi and A. Rejali, studied the relations betweenparadoxical decomposition and configuration for semigroups. In thepresent paper, we introduce one other concept of amenability typeon semigroups and groups which includes amenability of semigroupsand inner-amenability of groups. We have extend the previous knownresults to semigroups and groups satisfying this concept.
متن کاملTarski Number and Configuration Equations
The concept of configuration of groups which is defined in terms of finite partitions and finite strings of elements of the group is presented by Rosenblatt and Willis. To each set of configurations, a finite system of equations known as configuration equations, is associated. Rosenblatt and Willis proved that a discrete group G is amenable if and only if every possible instance of its configur...
متن کاملAdomian Decomposition Method On Nonlinear Singular Cauchy Problem of Euler-Poisson- Darbuox equation
n this paper, we apply Picard’s Iteration Method followed by Adomian Decomposition Method to solve a nonlinear Singular Cauchy Problem of Euler- Poisson- Darboux Equation. The solution of the problem is much simplified and shorter to arriving at the solution as compared to the technique applied by Carroll and Showalter (1976)in the solution of Singular Cauchy Problem.
متن کاملDynamic Problem Decomposition in Configuration
In this work, we show how the decomposition of a problem into a set of simpler and independent subproblems can be applied to automatic configuration. In particular, we describe a dynamic decomposition technique exploiting the compositional structure of complex objects. We show experimentally that such a decomposition can give greater improvements in the reduction of the computational effort tha...
متن کاملA Benders\' Decomposition Based Solution Method for Solving User Equilibrium Problem: Deterministic and Stochastic Cases
The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...
متن کامل